Clones: CLOsed queueing Networks Exact Sampling

نویسندگان

  • Anne Bouillard
  • Ana Busic
  • Christelle Rovetta
چکیده

We present Clones, a Matlab toolbox for exact sampling from the stationary distribution of a closed queueing network with finite capacities. This toolbox is based on recent results using a compact representation of sets of states that enables exact sampling from the stationary distribution without considering all initial conditions in the coupling from the past (CFTP) scheme. This representation reduces the complexity of the one-step transition in the CFTP algorithm to O(KM), where K is the number of queues and M the total number of customers; while the cardinality of the state space is exponential in the number of queues. In this paper, we focus on the algorithmic and implementation issues. We propose a new representation, that leads to onestep transition complexity of the CFTP algorithm that is in O(KM). We provide a detailed description of our matrixbased implementation. The toolbox can be downloaded at http://www.di.ens.fr/~rovetta/Clones.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect sampling for closed queueing networks

In this paper we investigate coupling from the past (CFTP) algorithms for closed queueing networks. The stationary distribution has a product form only in a very limited number of particular cases when queue capacity is nite, and numerical algorithms are intractable due to the cardinality of the state space. Moreover, closed networks do not exhibit any monotonic property enabling e cient CFTP. ...

متن کامل

Perfect Sampling for Multiclass Closed Queueing Networks

In this paper we present an exact sampling method for multiclass closed queuing networks. We consider networks for which stationary distribution does not necessarily have a product form. The proposed method uses a compact representation of sets of states, that is used to derive a bounding chain with significantly lower complexity of one-step transition in the coupling from the past scheme. The ...

متن کامل

Some Exact Results on Closed Queueing Networks with Blocking

We obtain equivalencies between closed queueing networks with blocking with respect to buffer capacities and the number of customers in the network. These results can be used in approximations, in the buffer allocation problem as well as to explain the behavior of closed queueing networks with finite buffers. We also present exact efficient solutions for special cases.

متن کامل

The Throughput Analysis of Product-Form Queueing Networks

Product-form closed queueing networks are widely-used analytical models for the performance analysis of computer and communication systems. Since the publication in 1963 of Jackson’s theorem, the first significant development in the theory of queueing networks, hundreds of papers have been devoted to the topic. Nevertheless, several important theoretical issues remain open. Among these, the eff...

متن کامل

Exact Solutions for Open, Closed and Mixed Queueing Networks with Rejection Blocking

Open, mixed and closed queueing networks with multiple job classes, reversible routing and rejection blocking are investigated in this paper. Jobs may change class membership and general service requirement distributions that depend on the job class are allowed. We prove that the equilibrium state probabilities have product form if at all stations either the scheduling discipline is symmetric o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • EAI Endorsed Trans. Future Intellig. Educat. Env.

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2014